Growing Context-Sensitive Languages and Church–Rosser Languages
نویسندگان
چکیده
منابع مشابه
On Growing Context-Sensitive Languages
Growing context-sensitive grammars (GCSG) are investigated. The variable membership problem for GCSG is shown to be NP-complete. This solves a problem posed in DW86]. It is also shown that the languages generated by GCSG form an abstract family of languages and several implications are presented.
متن کاملCharacterizations of Context-Sensitive Languages
We give “syntactic” characterizations of context-sensitive languages (CSLs) in terms of some restricted models of symport/antiport P systems. These are the first such characterizations of CSLs in terms of P systems. In particular, we show the following for any language L over a binary alphabet: 1. Let m be any integer ≥ 1. Then L is a CSL if and only if it can be accepted by a restricted sympor...
متن کاملParsing of Context-Sensitive Languages
This art icle presents some ideas from parsing Context-Sensit ive languages. Introduces Scattered-Context grammars and languages and describes usage of such grammars to parse CS languages. Also there are presented additional results fronr type checking and formal prograrn verification using CS parsing. I{eywords: Turing Machines, Parsing of Context-Sensitive Languages, Fornral Program Verificat...
متن کاملContext-Sensitive String Languages and Eecognizable Picture Languages
The theorem stating that the family of frontiers of recognizable tree languages is exactly the family of context-free languages (see J. Mezei and J. B. Wright, 1967, Inform. and Comput. 11, 3 29), is a basic result in the theory of formal languages. In this article, we prove a similar result: the family of frontiers of recognizable picture languages is exactly the family of context-sensitive la...
متن کاملMildly Context-Sensitive Dependency Languages
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constraints have been proposed to identify classes of dependency structures that are wellbalanced in this sense; the best-known but also most restrictive of these is projectivity. Most constraints are formulated on fully specif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1998
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2681